全文获取类型
收费全文 | 122篇 |
免费 | 2篇 |
出版年
2019年 | 2篇 |
2018年 | 1篇 |
2017年 | 1篇 |
2016年 | 5篇 |
2015年 | 2篇 |
2014年 | 4篇 |
2013年 | 48篇 |
2011年 | 1篇 |
2010年 | 2篇 |
2009年 | 1篇 |
2008年 | 3篇 |
2005年 | 1篇 |
2004年 | 1篇 |
2001年 | 1篇 |
1998年 | 3篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1993年 | 1篇 |
1992年 | 4篇 |
1990年 | 1篇 |
1986年 | 3篇 |
1985年 | 3篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 4篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1975年 | 1篇 |
1973年 | 2篇 |
1972年 | 4篇 |
1971年 | 1篇 |
1970年 | 3篇 |
1969年 | 2篇 |
1967年 | 3篇 |
1966年 | 3篇 |
排序方式: 共有124条查询结果,搜索用时 15 毫秒
91.
Richard C. Grinold 《海军后勤学研究》1972,19(1):123-136
Large complicated projects with interdependent activities can be described by project networks. Arcs represent activities, nodes represent events, and the network's structure defines the relation between activities and events. A schedule associates an occurrence time with each event: the project can be scheduled in several different ways. We assume that a known amount of cash changes hands at each event. Given any schedule the present value of all cash transactions can be calculated. The payment scheduling problem looks for a schedule that maximizes the present value of all transactions. This problem was first introduced by Russell [2]; it is a nonlinear program with linear constraints and a nonconcave objective. This paper demonstrates that the payment scheduling problem can be transformed into an equivalent linear program. The linear program has the structure of a weighted distribution problem and an efficient procedure is presented for its solution. The algorithm requires the solution of triangular systems of equations with all matrix coefficients equal to ± or 0. 相似文献
92.
93.
This paper presents an efficient algorithm for scheduling a single-category work force on 4-day or 3-day work weeks. Employees work 4 or 3 days each week, have A out of every B weekends off, and work no more than 5 consecutive days in a work stretch on 4-day work weeks and no more than 4 days in a work stretch on 3-day work weeks. Such conditions often prevail in 7-day-a-week organizations such as hospitals, manufacturing plants, and retail stores. We determine the minimum number of workers required to satisfy the scheduling constraints under any pattern of daily requirements. Then we present the algorithm for assigning days off for each worker, thereby determining the work schedules. We show that the algorithm, by construction, will necessarily satisfy the scheduling constraints. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 839–853, 1998 相似文献
94.
Kathryn M. Schumacher Richard Li‐Yang Chen Amy E.M. Cohn Jeremy Castaing 《海军后勤学研究》2016,63(3):236-246
We consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real‐world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum‐cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as a foundation, our primary focus is on a chance‐constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user‐defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut‐sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 236–246, 2016 相似文献
95.
96.
97.
98.
99.
100.